CSI - A Confluence Tool
نویسندگان
چکیده
This paper describes a new confluence tool for term rewrite systems. Due to its modular design, the few techniques implemented so far can be combined flexibly. Methods developed for termination analysis are adapted to prove and disprove confluence. Preliminary experimental results show the potential of our tool.
منابع مشابه
Certification of Confluence Proofs using CeTA
CeTA was originally developed as a tool for certifying termination proofs [5] which have to be provided as certificates in the CPF-format. Its soundness is proven within IsaFoR, the Isabelle Formalization of Rewriting. In the meantime, CeTA can also be used as a tool for certifying confluence and non-confluence proofs. In the following system description, we give a short overview on what kind o...
متن کاملDeciding Confluence of Ground Term Rewrite Systems in Cubic Time
It is well known that the confluence property of ground term rewrite systems (ground TRSs) is decidable in polynomial time. For an efficient implementation, the degree of this polynomial is of great interest. The best complexity bound in the literature is given by Comon, Godoy and Nieuwenhuis (2001), who describe an O(n5) algorithm, where n is the size of the ground TRS. In this paper we improv...
متن کاملCoLL: A Confluence Tool for Left-Linear Term Rewrite Systems
We present a confluence tool for left-linear term rewrite systems. The tool proves confluence by using Hindley’s commutation theorem together with three commutation criteria, including Church-Rosser modulo associative and/or commutative theories. Despite a small number of its techniques, experiments show that the tool is comparable to recent powerful confluence tools.
متن کاملRascal Tooling for Datatype Defining Rewrite Systems
It has been argued in [7] that using automated provers such as AProVE [4] and CSI [3] can benefit research projects on the topic of datatype defining rewrite systems (DDRSs), as the size of these DDRSs make manual completeness proofs long and error-prone. The authors of [7] note that no similar software exists for the ground-confluence property, and in [1] it is argued that such software should...
متن کاملConditional Confluence (System Description)
This paper describes the Conditional Confluence tool, a fully automatic confluence checker for first-order conditional term rewrite systems. The tool implements various confluence criteria that have been proposed in the literature. A simple technique is presented to test conditional critical pairs for infeasibility, which makes conditional confluence criteria more useful. Detailed experimental ...
متن کامل